Path computation algorithms in NS2
نویسندگان
چکیده
Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints. This paper deals with two distinct categories of path computation algorithms: on-line path computation algorithms adn on-line multi path algorithms. All these algorithms have been implemented in NS2 as an extension of OSPF-TE\ns and integrated with RSVPTE\ns.
منابع مشابه
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملTraffic Avoidance in VANET using Ant Colony Optimization
Nowadays traffic avoidance is most complicated problem in this urban area. This paper proposes how to avoid or quickly cross the traffic in large area based on Ant Colony Optimization (ACO) in VANET. It is proposed for identifying the best path to a destination in the simulation area. It has a traffic factor such as vehicle speed, number of vehicles percent in specific path, road capacity, and ...
متن کاملA Large Family of Multi-path Dual Congestion Control Algorithms
—The goal of traffic management is efficiently utilizing network resources via adapting of source sending rates and routes selection. Traditionally, this problem is formulated into a utilization maximization problem. The single-path routing scheme fails to react to instantaneous network congestion. Multi-path routing schemes thus have been proposed aiming at improving network efficiency. Unfort...
متن کاملk-Remainder Cordial Graphs
In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.
متن کاملاستفاده از الگوریتم ژنتیک در مسائل کوتاهترین مسیر چند معیاره بر پایه سیستمهای اطلاعات مکانی
Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...
متن کامل